A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
نویسندگان
چکیده
With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-live applications it is essential that graph pattern matching is performed as fast as possible. This challenge has been attacked recently by an approach we call search plan driven graph pattern matching. It has been presented independently by Batz as well as by Varró et al. However, until now there has been no experimental evaluation of this approach. We performed first experiments using the well known GT benchmark introduced by Varró et al. To complement this paper, we give an introduction to search plan driven graph pattern matching.
منابع مشابه
Efficient Model Transformations by Combining Pattern Matching Strategies
Recent advances in graph pattern matching techniques have demonstrated at various tool contests that graph transformation tools can scale up to handle very large models in model transformation problems. In case of local-search based techniques, pattern matching is driven by a search plan, which provides an optimal ordering for traversing and matching nodes and edges of a graph pattern. In case ...
متن کاملAdaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for pattern traversal (as an extension to traditional multiplicity and type considerations of existing tools) by estimating the expected performance of search plans on typical instance models that are available at transformatio...
متن کاملGeneric Search Plans for Matching Advanced Graph Patterns
In the current paper, we present search plans which can guide pattern matching for advanced graph patterns with edge identities, containment constraints, type variables, negative application conditions, attribute conditions, and injectivity constraints. Based on a generic search graph representation, all search plan operations (e.g. checking the existence of an edge, or extending a matching can...
متن کاملAn Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems
Graph edit distance is an error tolerant matching technique emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning and data mining; it represents the minimum-cost sequence of basic edit operations to transform one graph into another by means of insertion, deletion and substitution of vertices and/or edges. ...
متن کاملGrGen: A Fast SPO-Based Graph Rewriting Tool
Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster than any other tool known to us. Our graph rewriting tool implements the well-founded single-pushout...
متن کامل